Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.
Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… … Wikipedia
equivalent-gate complexity — ekvivalentiniais loginiais elementais išreikštas integracijos laipsnis statusas T sritis radioelektronika atitikmenys: angl. equivalent gate complexity vok. Äquivalentgatter Komplexität, f rus. степень интеграции в эквивалентных логических… … Radioelektronikos terminų žodynas
NP (complexity) — Diagram of complexity classes provided that P ≠ NP. The existence of problems outside both P and NP complete in this case was established by Ladner.[1] In computational complexity theory, NP is one of the most fundamental complexity classes. The… … Wikipedia
SL (complexity) — In computational complexity theory, SL (Symmetric Logspace or Sym L) is the complexity class of problems log space reducible to USTCON ( undirected s t connectivity ), which is the problem of determining whether there exists a path between two… … Wikipedia
Kolmogorov complexity — In algorithmic information theory (a subfield of computer science), the Kolmogorov complexity of an object, such as a piece of text, is a measure of the computational resources needed to specify the object. It is named after Soviet Russian… … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
NP-equivalent — In computational complexity theory, the complexity class NP equivalent is the set of function problems that are both NP easy and NP hard.[1] NP equivalent is the analogue of NP complete for function problems. For example, the problem FIND SUBSET… … Wikipedia
Cyclomatic complexity — (or conditional complexity) is a software metric (measurement). It was developed by Thomas J. McCabe, Sr. in 1976 and is used to indicate the complexity of a program. It directly measures the number of linearly independent paths through a program … Wikipedia
Model of hierarchical complexity — The model of hierarchical complexity, is a framework for scoring how complex a behavior is. It quantifies the order of hierarchical complexity of a task based on mathematical principles of how the information is organized and of information… … Wikipedia
Model of Hierarchical Complexity — The model of hierarchical complexity is a framework for scoring how complex a behavior is. It quantifies the order of hierarchical complexity of a task based on mathematical principles of how the information is organized and of information… … Wikipedia
Communication complexity — The notion of communication complexity was introduced by Yao in 1979,[1] who investigated the following problem involving two separated parties (Alice and Bob). Alice receives an n bit string x[clarification needed] and Bob another n bit string… … Wikipedia
